Discovering Causality in Large Databases

Acausal rule between two variables, X! Y , captures the relationship that the presence of X causes the appearance of Y. Because of its usefulness (compared to association rules), techniques for mining causal rules are beginning to be developed. However, the effectiveness of existing methods (such as the LCD and CU-path algorithms)are limited to mining causal rules among simple variables, and are inadequate to discover and represent causal rules among multi-value variables. In this paper, we propose that the causality between variables X and Y be represented in the form X! Y with conditional probability matrix MY jX: We also propose a new approach to discover causality in large databases based on partitioning. The approach partitions the items into item variables by decomposing ` `bad’’ item variables and composing ` ` not-good’’ item variables. In particular, we establish a method to optimize causal rules that merges the ` ` useless’’ information in conditional probability matrices of extracted causal rules.